Presentations for Subgroups of Monoids

نویسنده

  • N. Ruškuc
چکیده

The main result of this paper gives a presentation for an arbitrary subgroup of a monoid defined by a presentation. It is a modification of the well known Reidemeister–Schreier theorem for groups. Some consequences of this result are explored. It is proved that a regular monoid with finitely many left and right ideals is finitely presented if and only if all its maximal subgroups are finitely presented. An inverse monoid with finitely many left and right ideals is finitely presented as an inverse monoid if and only if it is finitely presented as a monoid. An example of a finitely presented monoid with a finitely generated but not finitely presented group of units is exhibited. © 1999 Academic Press

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite Idempotent Inverse Monoid Presentations

Several decidability problems for finite idempotent presentations of inverse monoids are solved, giving also insight into their structure. Besides providing a new elementary solution for the problem, solutions are obtained for the following problems: computing the maximal subgroups, being combinatorial, being semisimple, being fundamental, having infinite D-classes. The word problem for the lea...

متن کامل

Presentations for the monoids of singular braids on closed surfaces

We give presentations, in terms of generators and relations, for the monoids SBn(M) of singular braids on closed surfaces. The proof of the validity of these presentations can also be applied to verify, in a new way, the presentations given by Birman for the monoids of Singular Artin braids.

متن کامل

Fundamental Groups, Inverse Sch Utzenberger Automata, and Monoid Presentations

This paper gives decidable conditions for when a nitely generated subgroup of a free group is the fundamental group of a Sch utzenberger automaton corresponding to a monoid presentation of an inverse monoid. Also, generalizations are given to speciic types of inverse monoids as well as to monoids which are \nearly inverse." This result has applications to computing membership for inverse monoid...

متن کامل

On presentations of Brauer-type monoids

We obtain presentations for the Brauer monoid, the partial analogue of the Brauer monoid, and for the greatest factorizable inverse submonoid of the dual symmetric inverse monoid. In all three cases we apply the same approach, based on the realization of all these monoids as Brauer-type monoids.

متن کامل

Coherence for braided and symmetric pseudomonoids

Presentations for unbraided, braided and symmetric pseudomonoids are defined. Biequivalences characterising the semistrict bicategories generated by these presentations are proven. It is shown that these biequivalences categorify results in the theory of monoids and commutative monoids, and are generalisations of standard coherence theorems for braided and symmetric monoidal categories.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999